A Low Latency Hardware Multicast Routing Algorithm for Two-Dimensional Meshes
نویسنده
چکیده
Multicast communication is a signi cant operation in multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper, we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses wormhole routing mechanism and can send messages to any number of destinations within two start-up communication phases; hence the name, two-phase multicast (TPM) algorithm. The algorithm uses the base routing scheme used for unicast communication, thus minimizing the additional hardware support. The algorithm allows some intermediate nodes that are not in the destination set to perform the multicast functions. This feature allows exibility in multicast path selection and therefore improves the performance. A simulation study has been conducted to investigate the performance of the purposed TPM algorithm. The simulation results show that the purposed TPM algorithm performs significantly better for both contention-free and mixed-tra c conditions, when compared with the previously proposed multicast algorithms.
منابع مشابه
A hardware multicast routing algorithm for two-dimensional meshes
Multicast communication is a signiicant operation in multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper , we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses worm-hole routing mechanism and can send mess...
متن کاملTwo - Phase Multicast Routing Algorithms forTwo - Dimensional Meshes 1
Multicast communication is a signiicant operation in multicomputer systems and can be used to support several other collective communication operations. Hardware implementation is a viable solution to develop a low latency multicast algorithm. In this paper, we present a new multicast routing algorithm for two-dimensional meshes. The algorithm uses wormhole routing mechanism and can send messag...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملA Traac-balanced Adaptive Wormhole Routing Scheme for Two-dimensional Meshes 1
In this paper, we have analyzed several issues that are involved in developing low latency adaptive wormhole routing schemes for two-dimensional meshes. It is observed that along with adaptivity, balanced distribution of traac has a signiicant impact on the system performance. Motivated by this observation, we have developed a new fully adaptive routing algorithm called positive-rst-negative-rs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996